Polynomial-time reduction - PDFSEARCH.IO - Document Search Engine

Polynomial-time reduction
Results: 20

#	Item
11	Advanced Algorithms – COMS31900Lecture 16 Approximation Algorithms (part one) P, NP and constant factor approximations Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:21 Applied mathematics NP-complete NP-hard P versus NP problem NP Polynomial-time reduction P Complete Reduction Theoretical computer science Computational complexity theory Complexity classes
12	Advanced Algorithms – COMS31900Lecture 19 Approximation Algorithms (part four) Asymptotic Polynomial Time Approximation Schemes Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 Complexity classes Approximation algorithms NP-complete problems Polynomial-time approximation scheme Time complexity NP PTAS L-reduction APX Theoretical computer science Computational complexity theory Applied mathematics
13	Advanced Algorithms – COMS31900Lecture 19 Approximation Algorithms (part four) Asymptotic Polynomial Time Approximation Schemes Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 Complexity classes Approximation algorithms NP-complete problems Polynomial-time approximation scheme Time complexity NP PTAS L-reduction APX Theoretical computer science Computational complexity theory Applied mathematics
14	Introduction to Complexity Theory { Lecture Notes Oded Goldreich Department of Computer Science and Applied Mathematics Weizmann Institute of Science, Israel. Email: [removed] July 31, 1999 Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2000-12-12 06:50:00 Complexity classes Mathematical optimization Structural complexity theory NP-complete Polynomial-time reduction P versus NP problem NP P-complete Probabilistically checkable proof Theoretical computer science Computational complexity theory Applied mathematics
15	Symposium on Theoretical Aspects of Computer Science[removed]Nancy, France), pp[removed]www.stacs-conf.org COLLAPSING AND SEPARATING COMPLETENESS NOTIONS UNDER AVERAGE-CASE AND WORST-CASE HYPOTHESES XIAOYANG GU 1 AND JOHN Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2010-03-04 08:18:12 Complexity classes NP-complete NP Reduction P/poly Advice Many-one reduction Turing reduction Polynomial-time reduction Theoretical computer science Computational complexity theory Applied mathematics
16	Memcomputing NP-complete problems in polynomial time using polynomial resources and collective states Fabio L. Traversa,1, 2, ∗ Chiara Ramella,2, † Fabrizio Bonani,2, ‡ and Massimiliano Di Ventra1, § arXiv:[removed] Add to Reading List Source URL: arxiv.org Language: English - Date: 2014-12-03 20:27:51 Turing machine Models of computation Mathematical optimization Structural complexity theory Computational complexity theory NP P versus NP problem Reduction P-complete Theoretical computer science Applied mathematics Complexity classes
17	A Tale of Two Cultures: Phase Transitions in Physics and Computer Science Cristopher Moore University of New Mexico and the Santa Fe Institute Add to Reading List Source URL: tuvalu.santafe.edu Language: English - Date: 2006-12-15 13:47:11 Applied mathematics NP P versus NP problem EXPTIME P Complete Hamiltonian path Co-NP Polynomial-time reduction Theoretical computer science Computational complexity theory Complexity classes
18	THE P VERSUS NP PROBLEM STEPHEN COOK Add to Reading List Source URL: www.claymath.org Language: English - Date: 2013-08-12 10:39:14 Complexity classes NP-hard P versus NP problem NP P Bounded-error probabilistic polynomial Oracle machine Reduction Time complexity Theoretical computer science Computational complexity theory Applied mathematics
19	PDF Document Add to Reading List Source URL: www.unizar.es Language: English - Date: 2009-04-13 10:34:31 Complexity classes NP P versus NP problem P Bounded-error probabilistic polynomial Time complexity Oracle machine Reduction NP-hard Theoretical computer science Computational complexity theory Applied mathematics
20	PDF Document Add to Reading List Source URL: www.claymath.org Language: English - Date: 2006-08-04 16:47:47 Complexity classes NP-hard P versus NP problem NP P Bounded-error probabilistic polynomial Oracle machine Reduction Time complexity Theoretical computer science Computational complexity theory Applied mathematics

UPDATE